Fast Searching of Nearest Neighbor using Key Values in Data Mining

Spatial query which focus only on the geometrics properties of an object like points, rectangle etc. Now a day‟s many new applications which involve the queries that completely aim to return an object which satisfy equally on spatial predicate and their associated text. Spatial query takes the given location and a keyword as the input and finds the object that matches the both spatial predicate and the text related to the given query. Some of the spatial queries are range search and nearest neighbor retrieval which includes only geometric properties of an object. For example, In case of considering all the hotels, a nearest neighbor query would find for the hotel which is near, along with menu that user required to have in hotel among all the hotels in particular location simultaneously. At present the better solution is based on IR2-Tree which as few drawbacks that affect the efficiency in query retrieval. So we develop a new method Spatial inverted index that cope with 3D data to answer the nearest neighbor query using keyword along with key values in real time. Searching nearest neighbor query using key values will result in quick response of query when compared to keyword in real time.